27 Ergebnisse - Zeige 1 von 20.

Blockchains are meant to provide an append-only sequence (ledger) of transactions. Security commonly relies on a consensus protocol in which forks in the sequence are either prevented completely or are exponentially unlikely to last more than a few blocks. This monograph proposes the design of algorithms and a system to achieve high performance (a few seconds from the time of initiation for transactions to enter the blockchain), the absence of...

Keine Beschreibung.

Keine Beschreibung.

Keine Beschreibung.

In the history of modern computation, large mechanical calculators preceded computers. A person would sit there punching keys according to a procedure and a number would eventually appear. Once calculators became fast enough, it became obvious that the critical path was the punching rather than the calculation itself. That is what made the stored program concept vital to further progress. Once the instructions were stored in the machine, the e...

Keine Beschreibung.

Keine Beschreibung.

Excerpt from Efficient and Correct Execution of Parallel Programs That Share MemoryIn this paper, we consider an Optimization problem that arises in the execution Of parallel programs on shared memory multiple-instruction stream multiple-data stream (mimd) computers. A program on such a machine consists of many program segments each executed sequentially by a single processor. The processors have access to shared memory, and can execute standa...

Keine Beschreibung.

Excerpt from Query Processing in a Symmetric Parallel EnvironmentAssume each relation partitioned on A attribute using hash function. Joining S with T first and then R wi requires three repartitionings, since 5 is already partit on A.About the PublisherForgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.comThis book is a reproduction of an important historical work. Forgotten Books uses st...

Keine Beschreibung.

Excerpt from Optimal Best-Match RetrievalThe best-match problem (also known as the post office problem or the nearest neighbor problem arises in many applications, such as database management information retrieval [4, 7, molecular biology [15, pattern classification [11, 14, 18] and computational geometry The problem is to find, among a file of objects, the ones which are most similar or closest to a given target according to some similarity d...

Statistics is the activity of inferring results about a population given a sample. Historically, statistics books assume an underlying distribution to the data (typically, the normal distribution) and derive results under that assumption. Unfortunately, in real life, one cannot normally be sure of the underlying distribution. For that reason, this book presents a distribution-independent approach to statistics based on a simple computational c...

Keine Beschreibung.

Statistics is the activity of inferring results about a population given a sample. Historically, statistics books assume an underlying distribution to the data (typically, the normal distribution) and derive results under that assumption. Unfortunately, in real life, one cannot normally be sure of the underlying distribution. For that reason, this book presents a distribution-independent approach to statistics based on a simple computational c...

Inferring gene regulatory networks is a difficult problem to solve due to the relative scarcity of data compared to the potential size of the networks. While researchers have developed techniques to find some of the underlying network structure, there is still no one-size-fits-all algorithm for every data set. Network Inference in Molecular Biology examines the current techniques used by researchers, and provides key insights into which algo...

Excerpt from Optimal Best-Match Retrieval The best-match problem (also known as the post office problem or the nearest neighbor problem arises in many applications, such as database management information retrieval [4, 7, molecular biology [15, pattern classification [11, 14, 18] and computational geometry The problem is to find, among a file of objects, the ones which are most similar or closest to a given target according to some similarity...

Excerpt from Query Processing in a Symmetric Parallel Environment We consider a database machine consisting of n nodes connected by an O(n processing speed) bandwidth network. Each node consists of a processor, a random access memory, and a slower but much larger memory such as a disk. In order to approach optimal (O(n))speedup on this hardware architecture, we partition relations roughly evenly among the processors. We study the problem of o...

Excerpt from Join Processing in a Symmetric Parallel Environment We present and analyze a strategy for procuring joins on a highly parallel computer architecture. We model the architecture as consisting of n identical processor-meraory clusters interconnected by a symmetric network onto which many processors may send at once. The strategy entails partitioning each relation horizontally based on a perfect hashing function applied to a key of t...

Excerpt from Efficient and Correct Execution of Parallel Programs That Share Memory In this paper, we consider an optimization problem that arises in the execution of parallel programs on shared memory multiple-instruction stream multiple-data stream (MIMD) computers. A program on such a machine consists of many program segments each executed sequentially by a single processor. The processors have access to shared memory, and can execute stan...